COLUMN TESSELLATIONS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Replicating Tessellations

A theory of replicating tessellation of R is developed that simultaneously generalizes radix representation of integers and hexagonal addressing in computer science. The tiling aggregates tesselate Euclidean space so that the (m + 1)st aggregate is, in turn, tiled by translates of the ruth aggregate, for each m in exactly the same way. This induces a discrete hierarchical addressing systsem on ...

متن کامل

Inverting Dirichlet Tessellations

Given a collection of points in the plane, one may draw a cell around each point in such a way that each point’s cell is the portion of the plane consisting of all locations closer to that point than to any of the other points. The resulting geometric figure is called a Dirichlet tessellation. An algorithm for obtaining the boundaries of the cells given the points was derived by Green and Sibso...

متن کامل

Poisson-Voronoi Tessellations

In particular, the location of S in R d is immaterial (stationarity) and E(N(S)) = λμ =Var(N(S)) (equality of mean and variance). An alternative characterization of the Poisson process involves the limit of the uniform distribution on expanding cubes C ⊆ R . Let ν denote the volume of C. Given m independent uniformly distributed particles in C and a measurable set S ⊆ C of volume μ, the probabi...

متن کامل

Tessellations of Solvmanifolds

Let A be a closed subgroup of a connected, solvable Lie group G, such that the homogeneous space A\G is simply connected. As a special case of a theorem of C. T. C. Wall, it is known that every tessellation A\G/Γ of A\G is finitely covered by a compact homogeneous space G′/Γ′. We prove that the covering map can be taken to be very well behaved — a “crossed” affine map. This establishes a connec...

متن کامل

On shape Delaunay tessellations

Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Image Analysis & Stereology

سال: 2015

ISSN: 1854-5165,1580-3139

DOI: 10.5566/ias.1285